Reviewing and Discussing Graph Reduction in Edge Computing Context
نویسندگان
چکیده
Much effort has been devoted to transferring efficiently different machine-learning algorithms, and especially deep neural networks, edge devices in order fulfill, among others, real-time, storage energy-consumption issues. The limited resources of the necessity for energy saving lengthen durability their batteries, encouraged an interesting trend reducing networks graphs, while keeping predictability almost untouched. In this work, alternative latest techniques finding these reductions size is proposed, seeking figure out a simplistic way shrink maintaining, as far possible, testing on well-known datasets.
منابع مشابه
The edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملnorms and ideology in translation of children literature in persian context
اهداف عمده ی این مطالعه دو دسته هستند:1) تعیین هنجار های اجتماعی فرهنگی مورد استفاده در ترجمه ی کتاب کودک برای کودکان ایرانی 2) بررسی مفهوم کودک در ایران و ائدئولوژی این جامعه در رابطه با کودک که مترجم را مجبور به بازسازی کتابهای داستان برای کودکان ایرانی میکند. به این منظور, ابتدا ,مجموعه ای از 30 کتاب داستان و ترجمه های فارسی انها بر اساس مدلlambert and van gorp(2006)مقایسه شد و سپس استراتژیه...
15 صفحه اولTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملEdge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2022
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation10090161